Multiresolution approximation scale and time-shift subspaces
نویسندگان
چکیده
منابع مشابه
Multiresolution approximation scale and time-shift subspaces
Multiresolution Approximation subspaces are L2(R)-subspaces defined for each scale over all time shifts, i.e., “scale subspaces”, while with respect to a given wavelet, the signal space L2(R) not only admits orthogonal scale subspaces basis, but orthogonal “time shift subspaces” basis as well. It is therefore natural to expect both scale subspaces and time shift subspaces to play a role in Wave...
متن کاملApproximation from shift - invariant subspaces of L 2 ( IR d )
Abstract: A complete characterization is given of closed shift-invariant subspaces of L2(IR) which provide a specified approximation order. When such a space is principal (i.e., generated by a single function), then this characterization is in terms of the Fourier transform of the generator. As a special case, we obtain the classical Strang-Fix conditions, but without requiring the generating f...
متن کاملApproximation from Shift - Invariant Subspaces of L 2 ( R d )
In this report, a summary of [1] is given. In [1] the authors provide a complete characterization of closed shift-invariant subspaces of L2(R) and the corresponding approximation order. The characterization of principal shift-invariant spaces is given in terms of the Fourier transform of the generator. The approximation order of a general shift-invariant space is the same as a suitably chosen p...
متن کاملAPPROXIMATION FROM SHIFT-INVARIANT SUBSPACES OF L2(Rd)
A complete characterization is given of closed shift-invariant subspaces of L2(Rd) which provide a specified approximation order. When such a space is principal (i.e., generated by a single function), then this characterization is in terms of the Fourier transform of the generator. As a special case, we obtain the classical Strang-Fix conditions, but without requiring the generating function to...
متن کاملOn Covering Approximation Subspaces
Let (U ′; C′) be a subspace of a covering approximation space (U ; C) and X ⊂ U ′. In this paper, we show that C′(X) = C(X)⋂ U ′ and B′(X) ⊂ B(X) ⋂ U ′. Also, C(X) = C′(X)⋂ C(U ′) iff (U ; C) has Property Multiplication. Furthermore, some connections between outer (resp. inner) definable subsets in (U ; C) and outer (resp. inner) definable subsets in (U ′; C′) are established. These results ans...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Multidimensional Systems and Signal Processing
سال: 2006
ISSN: 0923-6082,1573-0824
DOI: 10.1007/s11045-006-0002-z